Expander graph

Results: 102



#Item
51Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2

Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:50
52Asymptotic Learning on Bayesian Social Networks∗ Elchanan Mossel Allan Sly  Omer Tamuz

Asymptotic Learning on Bayesian Social Networks∗ Elchanan Mossel Allan Sly Omer Tamuz

Add to Reading List

Source URL: people.hss.caltech.edu

Language: English - Date: 2014-01-28 19:58:46
531  Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis

1 Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis

Add to Reading List

Source URL: dept.stat.lsa.umich.edu

Language: English - Date: 2016-04-09 11:17:17
54Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues ∗ Alexander Tsiatas

Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues ∗ Alexander Tsiatas

Add to Reading List

Source URL: www2013.wwwconference.org

Language: English - Date: 2014-07-21 08:47:04
55Expander Graphs and their Applications Draft - not for distribution Shlomo Hoory IBM Research Laboratory Haifa, Israel

Expander Graphs and their Applications Draft - not for distribution Shlomo Hoory IBM Research Laboratory Haifa, Israel

Add to Reading List

Source URL: www.math.ias.edu

Language: English - Date: 2006-05-18 11:21:02
56Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory Luca Trevisan University of California, Berkeley

Lecture Notes on Expansion, Sparsest Cut, and Spectral Graph Theory Luca Trevisan University of California, Berkeley

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2015-05-26 11:28:40
57On the Mixing Time of Directed Social Graphs and Security Implications Abedelaziz Mohaisen Huy Tran

On the Mixing Time of Directed Social Graphs and Security Implications Abedelaziz Mohaisen Huy Tran

Add to Reading List

Source URL: www-users.cs.umn.edu

Language: English - Date: 2012-04-20 11:44:08
58Background  Inverse acts Graphs of Inverse semigroups

Background Inverse acts Graphs of Inverse semigroups

Add to Reading List

Source URL: www-users.york.ac.uk

Language: English - Date: 2011-05-17 09:00:00
59Addendum to the paper \Randomness in Interactive Proofs

Addendum to the paper \Randomness in Interactive Proofs" Mihir Bellare Oded Goldreichy

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:24:28
60Deterministic Amplification of Space-Bounded Probabilistic Algorithms Ziv Bar-Yossef Department of Electrical Engineering and Computer Science U.C. Berkeley Berkeley, CA 94720

Deterministic Amplification of Space-Bounded Probabilistic Algorithms Ziv Bar-Yossef Department of Electrical Engineering and Computer Science U.C. Berkeley Berkeley, CA 94720

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:25:14